辛算法应用于Duffing方程的保结构性

讨论了不受外力的Duffing方程在辛算法和非辛算法作用下，相轨线被保持和破坏的性质。证明了当时间步长充分小时，辛算法可以保持原系统的大部分不变闭曲线，而非辛算法却做不到这一点。     

浅谈培养解题能力

从深刻理解数学概念内涵、熟悉数学公式及变式和注重解题过程分析三个方面谈如何有效培养学生的解题能力 ,进而促进学生数学能力的发展     

Aggregating courier deliveries

We consider the problem of efficiently scheduling deliveries by an uncapacitated courier from a central location under online arrivals. We consider both adversary‐controlled and Poisson arrival processes. In the adversarial setting we provide a randomized (3βΔ/2δ ? 1) ‐competitive algorithm, where β is the approximation ratio of the traveling salesman problem, δ is the minimum distance between the central location and any customer, and Δ is the length of the optimal traveling salesman tour overall customer locations and the central location. We provide instances showing that this analysis is tight. We also prove a 1 + 0.271Δ/δ lower‐bound on the competitive ratio of any algorithm in this setting. In the Poisson setting, we relax our assumption of deterministic travel times by assuming that travel times are distributed with a mean equal to the excursion length. We prove that optimal policies in this setting follow a threshold structure and describe this structure. For the half‐line metric space we bound the performance of the randomized algorithm in the Poisson setting, and show through numerical experiments that the performance of the algorithm is often much better than this bound.     

不变矩理论及其在目标识别中的应用

几何形状的识别在计算机视觉中具有十分重要的意义,一般几何形状可以分为区域和边界两种。不变矩特征在图像平移、伸缩、旋转时均保持不变。介绍了利用图像的不变矩向量进行目标形状识别的方法,并比较了Hu提出的基于区域的不变矩和Chen提出的基于边界的不变矩的性能和计算速度。     

Cyclic scheduling in robotic flowshops with bounded work‐in‐process levels

This study addresses cyclic scheduling in robotic flowshops with bounded work‐in‐process (WIP) levels. The objective is to minimize the cycle time or, equivalently, to maximize the throughput, under the condition that the WIP level is bounded from above by a given integer number. We present several strongly polynomial algorithms for the 2‐cyclic robotic flowshop scheduling problems for various WIP levels. © 2010 Wiley Periodicals, Inc. Naval Research Logistics 58: 1–16, 2011     

过程挖掘算法

过程挖掘又称工作流挖掘,主要依据日志中记录的过程实例执行信息重构工作流过程模型,是工作流再设计与分析方法的一项关键技术。对目前主流的过程挖掘算法和相关工具进行了研究,把过程挖掘算法按照特性及解决问题分成了4类,对每类算法的优缺点进行比较研究。最后指出了目前过程挖掘研究中存在的问题。     

测向交叉定位系统多目标数据关联研究

多目标测量数据关联问题是分布式被动交叉测向定位系统必须解决的问题,首先提出了基于残差的数据关联方法,但多目标时该方法运算量很大。针对这一缺点,提出了基于不变量的目标数据关联新方法,通过数字仿真对比了这两种方法的数据正确关联概率。仿真结果表明:基于不变量的方法正确关联概率与基于残差的数据关联方法相当,但计算量远小于后者。     

ISDT算法的数据压缩处理及其性能分析

过程数据的实时压缩和趋势提取可以显著提高过程控制系统的整体性能.传统的SDT数据压缩算法不能很好地适应现今过程控制的要求,无法获得满意的压缩结果.针对SDT算法的弊端,提出了一种改进的SDT数据压缩算法,并进行了两种算法的性能对比.对合成数据仿真计算的分析结果表明,基于ISDT算法的过程数据压缩性能有大幅度的提高,更好地满足了现今过程控制中实时数据处理和趋势分析的要求.     

基于层次分析法的化工企业火灾风险评估研究

化工企业火灾风险评估对于化工生产至关重要。针对化工行业的火灾风险,结合层次分析法和模糊识别模式的优点,提出了基于层次分析—模糊识别的综合评价方法,并通过实例评估证明了这种评价方法行之有效。     

Modeling and analysis of a mixed‐model assembly line with stochastic operation times

We consider a mixed‐model assembly line (MMAL) comprised a set of workstations and a conveyor. The workstations are arranged in a serial configuration. The conveyor moves at a constant speed along the workstations. Initial units belonging to different models are successively fed onto the conveyor, and they are moved by the conveyor to pass through the workstations to gradually generate final products. All assembling tasks are manually performed with operation times to be stochastic. An important performance measure of MMALs is overload times that refer to uncompleted operations for operators within their work zones. This paper establishes a method to analyze the expected overload times for MMALs with stochastic operation times. The operation processes of operators form discrete time nonhomogeneous Markov processes with continuous state spaces. For a given daily production schedule, the expected overload times involve in analyzing the Markov processes for finite horizon. Based on some important properties of the performance measure, we propose an efficient approach for calculating the expected overload times. Numerical computations show that the results are very satisfactory. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007